Meshing Volumes Bounded by Smooth Surfaces

Maillages de volumes bornés par des surfaces lisses par morceaux. (Meshing Volumes bounded by Piecewise Smooth Surfaces)

published in Proc . 14 th International Meshing Roundtable , 2005 , 203 - 219 Meshing Volumes Bounded by Smooth Surfaces ∗

This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like volume mesher, to get a greedy algorithm that samples the interior and the boundary of the domain at once. The algorithm constructs provably-good meshes, it gives control on the size of the mesh elements through a ...

5 A . 1 Meshing 3 D Domains Bounded by Piecewise Smooth Surfaces ∗

This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle multivolume domains defined by non connected or non manifold surfaces. The boundary and subdivision surfaces are assumed to be described by a complex formed by surface patches stitched together along curve segments. The meshing algorithm is a Delaunay refinement and it uses the not...

ACS Algorithms for Complex Shapes with Certified Numerics and Topology Meshing 3D domains bounded by piecewise smooth surfaces

This report provides an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle as well subdivisions of the domain forming non manifold surfaces. The boundaries and constraints are assumed to be described as a complex formed by a set of vertices, a set of curved segments and a set of surface patches. Each curve segment is assumed to be a piece of a closed smo...

Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation

Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning...